Relating the PSPACE reasoning power of Boolean Programs and Quantified Boolean Formulas
نویسندگان
چکیده
Relating the PSPACE reasoning power of Boolean Programs and Quantified Boolean Formulas Alan Skelley Master of Science Graduate Department of Computer Science University of Toronto 2000 We present a new propositional proof system based on a recent new characterization of polynomial space (PSPACE) called Boolean Programs, due to Cook and Soltys. We show that this new system, BPLK, is polynomially equivalent to the system G, which is based on the familiar and very different quantified Boolean formula (QBF) characterization of PSPACE due to Stockmeyer and Meyer. We conclude with a discussion of some closely related open problems and their implications.
منابع مشابه
Propositional PSPACE Reasoning with Boolean Programs Versus Quantified Boolean Formulas
We present a new propositional proof system based on a somewhat recent characterization of polynomial space (PSPACE) called Boolean programs, due to Cook and Soltys. The Boolean programs are like generalized extension atoms, providing a parallel to extended Frege. We show that this new system, BPLK, is polynomially equivalent to the system G, which is based on the familiar but very different qu...
متن کاملDichotomy Theorems for Alternation-Bounded Quantified Boolean Formulas
In 1978, Schaefer proved his famous dichotomy theorem for generalized satisfiability problems. He defined an infinite number of propositional satisfiability problems, showed that all these problems are either in P or NP-complete, and gave a simple criterion to determine which of the two cases holds. This result is surprising in light of Ladner’s theorem, which implies that there are an infinite...
متن کاملCS 2401 - Introduction to Complexity Theory Lecture # 5 : Fall , 2015
• Previously covered L, NL, PSPACE, NPSPACE – A language L is in SPACE(s(n)), where s : N → N, iff there is a deterministic TM M deciding L such that, on any input of length n, M ’s tape head visits at most c · s(n) cells over all non-input tapes, where c is a constant – Similarly, L ∈ NSPACE(s(n)) iff there is a non-deterministic TM M deciding L such that, on any input of length n and for any ...
متن کاملThe threshold for random (1,2)-QSAT
The QSAT problem is the quantified version of the SAT problem. We show the existence of a threshold effect for the phase transition associated with the satisfiability of random quantified extended 2-CNF formulas. We consider boolean CNF formulas of the form ∀X∃Y ϕ(X, Y), where X has m variables, Y has n variables and each clause in ϕ has one literal from X and two from Y. For such formulas , we...
متن کاملBounded-width QBF is PSPACE-complete
Tree-width is a well-studied parameter of structures that measures their similarity to a tree. Many important NP-complete problems, such as Boolean satisfiability (SAT), are tractable on bounded tree-width instances. In this paper we focus on the canonical PSPACE-complete problem QBF, the fully-quantified version of SAT. It was shown by Pan and Vardi that this problem is PSPACE-complete even fo...
متن کامل